The Iterative Boolean Minimizer Fc-min
نویسنده
چکیده
A novel two-level Boolean minimization method is presented here. In contrast to classical methods the cover of the on-set is computed first, whilst no implicants are known to this phase. The implicants are being derived from the source terms by their expansion directed by the cover. This allows us to generate group implicants directly, avoiding the time-consuming implicant expansions and reductions. The method is especially efficient for problems with many input and output variables, where other minimization tools (ESPRESSO) are extremely slow.
منابع مشابه
Two-Level Boolean Minimizer BOOM-II
We propose a novel two-level Boolean minimizer coming in succession to our previously developed minimizer BOOM, so we have named it BOOM-II. It is a combination of two minimizers, namely BOOM and FC-Min. Each of these two methods has its own area where it is most efficiently applicable. We have combined these two methods together to be able to solve all kinds of problems efficiently, independen...
متن کاملOutput Grouping-based Decomposition of Logic Functions
We present a method allowing us to determine the grouping of the outputs of the multi-output Boolean logic function for a single-level partitioning and minimization. Some kind of decomposition is often needed during the synthesis of logic circuits and the subsequent mapping onto technology. Sometimes a circuit has to be divided into several stand-alone parts, among its outputs, or possibly its ...
متن کاملA Hybrid Gradient-Projection Algorithm for Averaged Mappings in Hilbert Spaces
It is well known that the gradient-projection algorithm GPA is very useful in solving constrained convex minimization problems. In this paper, we combine a general iterative method with the gradient-projection algorithm to propose a hybrid gradient-projection algorithm and prove that the sequence generated by the hybrid gradient-projection algorithm converges in norm to a minimizer of constrain...
متن کاملA SOP Minimizer for Logic Functions Described by Many Product Terms Based on Ternary Trees
We introduce a new efficient minimization method for functions described by many (up to millions) product terms. The algorithm is based on processing a newly proposed efficient representation of a set of product terms – a ternary tree. The minimization procedure is based on a fast application of basic Boolean operations upon the ternary tree, combined with algorithms used in the Espresso minimi...
متن کاملExponential Complexity of Satisfiability Testing for Linear-Size Boolean Formulas
The exponential complexity of the satisfiability problem for a given class of Boolean circuits is defined to be the infimum of constants α such that the problem can be solved in time poly(m) 2, where m is the circuit size and n is the number of input variables [IP01]. We consider satisfiability of linear Boolean formula over the full binary basis and we show that the corresponding exponential c...
متن کامل